Layout Randomization and Nondeterminism
نویسندگان
چکیده
In security, layout randomization is a popular, effective attack mitigation technique. Recent work has aimed to explain it rigorously, focusing on deterministic systems. In this paper, we study layout randomization in the presence of nondeterministic choice. We develop a semantic approach based on denotational models and simulation relations. This approach abstracts from language details, and helps manage the delicate interaction between probabilities and nondeterminism.
منابع مشابه
Teaching Nondeterminism as a Special Case of Randomization
Nondeterminism is a central concept in computer science. Every student of computer science is faced with this concept, since it is the basis of the -completeness theory and is applied in automata theory, formal languages, and many more areas. Students tend to have difficulties with the abstract concept of nondeterminism. Here a different approach to nondeterminism is proposed. Students should f...
متن کاملComputation Power of Randomization and Nondeterminism
The fundamental questions of computation theory are related to the relative power of determinism, nondeterminism, and randomization. The famous P vs. NP problem is not the only one of main interest. The class of practically solvable algorithmic problems is not specified by deterministic polynomial time (P) anymore, but by bounded-error polynomial time algorithms. Hence, the comparison of the ef...
متن کاملUsing Control Network Programming in Teaching Randomization
A series of two reports are presented to this conference. The aim of the series is to demonstrate that Control Network Programming, respectively Spider, can be used as an excellent environment for teaching and learning both nondeterminism and randomization. More specifically, the emphasis is on CNP implemented models and algorithms typically studied in courses on the Computation theory and Arti...
متن کاملOn Layout Randomization for Arrays and Functions
Low-level attacks often rely on guessing absolute or relative memory addresses. Layout randomization aims to thwart such attacks. In this paper, we study layout randomization in a setting in which arrays and functions can be stored in memory. Our results relate layout randomization to language-level protection mechanisms, namely to the use of abstract locations (rather than integer addresses). ...
متن کاملAddress Space Layout Permutation
Address space randomization is an emerging and promising method for stopping a broad range of memory corruption attacks. By randomly shifting critical memory regions at process initialization time, a memory layout randomization scheme converts an otherwise successful malicious attack into a benign process crash. Recent work[7] has shown that current randomization schemes can be bruteforced atta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 298 شماره
صفحات -
تاریخ انتشار 2013